Planar triangulations, bridgeless planar maps and Tamari intervals
نویسندگان
چکیده
منابع مشابه
From generalized Tamari intervals to non-separable planar maps (extended abstract)
Let v be a grid path made of north and east steps. The lattice TAM(v), based on all grid paths weakly above the grid path v sharing the same endpoints as v, was introduced by Préville-Ratelle and Viennot (2014) and corresponds to the usual Tamari lattice in the case v = (NE). They showed that TAM(v) is isomorphic to the dual of TAM(←−v ), where←−v is the reverse of v with N and E exchanged. Our...
متن کاملEncoding and Decoding of Planar Maps through Conforming Delaunay Triangulations
This paper describes a method to represent a Planar Map (PM) through a Conforming Delaunay Triangulation (CDT) with applications in a server-client environment. At the server a CDT of the edges of the PM is determined. As the PM is now embedded by the CDT it is sufficient to send to the client the list of coordinates of the CDT nodes and an efficient encoded bitmap of the corresponding PM-CDT e...
متن کاملPlanar Minimum-Weight Triangulations
The classic problem of nding a minimum-weight triangulation for a given planar straight-line graph is considered in this paper. A brief overview of known methods is given in addition to some new results. A parallel greedy triangulation algorithm is presented along with experimental data that suggest a logarithmic relationship between the number of input vertices and its running time in the aver...
متن کاملEfficient Computation of Planar Triangulations
In 19] we introduced a new algorithm for computing planar triangulations of faceted surfaces for surface parameter-ization. Our algorithm computes a mapping that minimizes the distortion of the surface metric structures (lengths, angles, etc.). Compared with alternative approaches, the algorithm provides a signiicant improvement in robustness and applicability; it can handle more complicated su...
متن کاملParallel ips on planar triangulations
In this paper, we analyze ips over triangulations. Given a convex quadrilateral divided into two triangles in the triangulation, a ip consists in removing the triangle and replacing them by the two whose common side is the opposite diagonal. A parallel ip is a series of ips on disjoint quadrilaterals performed at the same time. We analyze the number of parallel ips that are necessary to transfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2018
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2017.12.002